Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls

نویسنده

  • Stephan Kreutzer
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expressive Power of Query Languages for Constraint Complex Value Databases

Motivated by constraint complex values which allow us to represent nested finitely representable sets, we study the expressive power of various query languages over constraint complex value databases. The tools we use come in the form of collapse results which are well established results in the context of first-order logic. We show that activegeneric collapse carries over to second-order logic...

متن کامل

Introducing External Functions in ConstraintQuery

Constraint databases use constraints to model and query data. In particular, constraints allow a nite representation of innnite sets of relational tuples (also called generalized tuples). The choice of different logical theories to express constraints inside relational languages leads to the deenition of constraint languages with diierent expressive power. Practical constraint database language...

متن کامل

Definability and Descriptive Complexity on Databases of Bounded Tree-Width

We study the expressive power of various query languages on relational databases of bounded tree-width. Our first theorem says that fixed-point logic with counting captures polynomial time on classes of databases of bounded tree-width. This result should be seen on the background of an important open question of Chandra and Harel [7] asking whether there is a query language capturing polynomial...

متن کامل

Query Evaluation in Constraint Databases ( Tutorial Proposal )

DatabasesImages of Concrete DatabasesConcrete Databases'&$%'$'&$%D1:R = f(a; 1); (a; 2);(a; 3); : : : g'(D1):'(D1) = f(a; 1); (a; 2);: : : ; (a; 9)g' = R(x; y) ^ y < 10-f(a; 1 t)gf(a; 1 t 5);(a; 3 t) gf(a; 1 t 9)gf(a; 1 t 5);(a; 3 t 9) geval(')(E1) -eval(')(E2) -6kE1k 6kE2k6k:k 6k:kE1...

متن کامل

A Representation Independent Language for Planar Spatial Databases with Euclidean Distance

Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data such as in GIS systems, but also there exist efficient algorithms for the core operations in the query languages. However, an important limitation of the linear constraint data model is that it cannot model constructs ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001